Storing RDF as a Graph
نویسندگان
چکیده
RDF is the first W3C standard for enriching information resources of the Web with detailed meta data. The semantics of RDF data is defined using a RDF schema. The most expressive language for querying RDF is RQL, which enables querying of semantics. In order to support RQL, a RDF storage system has to map the RDF graph model onto its storage structure. Several storage systems for RDF data have been developed, which store the RDF data as triples in a relational database. To evaluate an RQL query on those triple structures, the graph model has to be rebuilt from the triples. In this paper, we presented a new approach to store RDF data as a graph in a object-oriented database. Our approach avoids the costly rebuilding of the graph and efficiently queries the storage structure directly. The advantages of our approach have been shown by performance test on our prototype implementation OO-Store.
منابع مشابه
Graph summaries for optimizing graph pattern queries on RDF databases
The adoption of the Resource Description Framework (RDF) as a metadata and semantic data representation standard is spurring the development of high-level mechanisms for storing and querying RDF data. A common approach for managing and querying RDF data is to build on Relational/Object Relational Database systems and translate queries in an RDF query language into queries in the native language...
متن کاملStoring Rdf Graphs Using Nl-addressing
NL-addressing is a possibility to access information using natural language words as addresses of the information stored in the multi-dimensional numbered information spaces. For this purpose the internal encoding of the letters is used to generate corresponded co-ordinates. The tool for working in such style is named OntoArM. Its main principles, functions and using for storing RDF graphs are ...
متن کاملRDF Object Type and Reification in Oracle
Resource Description Framework (RDF) is a standard for representing information that can be identified using a Universal Resource Identifier. In particular, it is intended for representing metadata about Web resources. RDF is being used in numerous application areas, including Life Sciences, Digital Libraries, and Intelligence. The RDF data structure is a directed graph or network. Current solu...
متن کاملApplication-Specific Schema Design for Storing Large RDF Datasets
In order to realize the vision of the Semantic Web, a semantic model for encoding content in the World Wide Web, efficient storage and retrieval of large RDF data sets is required. A common technique for storing RDF data (graphs) is to use a single relational database table, a triple store, for the graph. However, we believe a single triple store cannot scale for the needs of large-scale applic...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003